Equilibrium Bandwidth and Buuer Allocations for Elastic Traacs
نویسنده
چکیده
| Consider a set of users sharing a network node under an allocation scheme that provides each user with a xed minimum and a random extra amount of bandwidth and buuer. Allocations and prices are adjusted to adapt to resource availability and user demands. Equilibrium is achieved when all users optimize their utility and demand equals supply for non-free resources. We analyze two models of user behavior. We show that at equilibrium expected return on purchasing variable resources can be higher than that on xed resources. Thus users must balance the marginal increase in utility due to higher return on variable resources and the marginal decrease in utility due to their variability. For the rst user model we further show that at equilibrium where such tradeoo is optimized all users hold strictly positive amounts of variable bandwidth and buuer. For the second model we show that if both variable bandwidth and buuer are scarce then at equilibrium every user either holds both variable resources or none.
منابع مشابه
Equilibrium Allocation and Pricing of Variable Resources Among User-Suppliers
We propose a novel model of resource sharing schemes that provide each user with a xed minimum and a random extra amount of bandwidth and buuer. Allocations and prices are adjusted to adapt to resource availability and user demands. At equilibrium, if it exists, all users optimize their utility and resource demand equals supply, i.e., the marginal increase in user utility due to higher return o...
متن کاملDistributed Algorithms for Fair Bandwidth Allocation to Elastic Services in Broadband Networks
The Nash arbitration scheme from cooperative game theory provides a natural framework to address the allocation of available bandwidth in network links which is network (Pareto) optimal and satisfies precise notions of fairness. In this paper we propose two distributed bandwidth allocation schemes that allocate available badwidths to elastic sources according to the Nash arbitration scheme. We ...
متن کاملDynamic Thresholds for Multiple Loss Priorities
Buuer management schemes are needed in shared-memory ATM switches to regulate the sharing of memory among diierent output port queues and among traac classes with diierent loss priorities. Earlier we proposed a single-priority scheme called Dynamic Threshold, in which the maximum permissible queue length is proportional to the unused buuering in the switch. In this paper, we propose, analyze an...
متن کاملIntegrated Rate and Credit Based Flow Control for Unicast ABR Service in ATM Networks
We propose a ow-control scheme that combines the merits of credit-and rate-based ow-control schemes by applying direct control over both bandwidth and buuer resources. The goal of the proposed scheme is to design an optimal rate-control policy for a given nite buuer capacity by maximizing average throughput and bounding end-to-end delay. By applying the second-order rate control, the proposed s...
متن کاملNetwork iso-elasticity and weighted α-fairness
Abstract: When a communication network’s capacity increases, it is natural to want the bandwidth allocated to increase to exploit this capacity. But, if the same relative capacity increase occurs at each network resource, it is also natural to want each user to see the same relative benefit, so the bandwidth allocated to each route should remain proportional. We will be interested in bandwidth ...
متن کامل